Simple Change Adaptive Routing Algorithm for Satellite IP Networks

نویسندگان

  • Liu Feng
  • Zhang Yu
چکیده

although the LEO constellation has dynamic satellite network topology, the topology changes are predictable and periodic. Based on the characteristics above, a new simple change adaptive routing algorithm (SCARA) is proposed for satellite IP networks. SCARA uses simple rules to decide the next hop. The rules are 1) using only two possible directions to reduce the routing path; 2) assigning higher priority to the direction with higher satellite latitude; 3) avoiding the polar region;4) avoiding congestion with local buffer and queue information. SCARA is a kind of distributed routing algorithm. Only local information, such as satellite latitude, logical location, buffer, source and destination address, etc., is needed to route packets, and information from other satellites is not necessary for routing. This feature makes SCARA can be used in satellite IP networks. A simulator is developed for evaluating the performance. The simulation result shows that SCARA has the capability to find the minimum path, lower end-to-end delay and lower time complexity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simple Change Adaptive Routing Algorithm for Satellite IP Networks

although the LEO constellation has dynamic satellite network topology, the topology changes are predictable and periodic. Based on the characteristics above, a new simple change adaptive routing algorithm (SCARA) is proposed for satellite IP networks. SCARA uses simple rules to decide the next hop. The rules are 1) using only two possible directions to reduce the routing path; 2) assigning high...

متن کامل

Priority-based Adaptive Shortest Path Routing for IP over LEO Satellite Networks

Designing an efficient routing algorithm for LEO satellite constellations is crucial for optimizing IP over Satellite (IPoS) network resources. Since there could be many shortest paths between two satellites, an efficient routing algorithm should provide better utilization of these paths. For this purpose, we propose a Priority-based Adaptive Routing (PAR) technique, which distributedly sets th...

متن کامل

An Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks

LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...

متن کامل

VoIP PERFORMANCE IN NGEO SATELLITE IP NETWORKS WITH ON-BOARD PROCESSING CAPABILITY

VoIP PERFORMANCE IN NGEO SATELLITE IP NETWORKS WITH ON-BOARD PROCESSING CAPABILITY In this thesis study, an adaptive routing policy utilizing the real-time network information of a two-layered satellite network is introduced. In a satellite network, depending on the requirements and properties of services provided, various kinds of satellites from different orbits can be employed. Geostationary...

متن کامل

Improvement of Routing Operation Based on Learning with Using Smart Local and Global Agents and with the Help of the Ant Colony Algorithm

Routing in computer networks has played a special role in recent years. The cause of this is the role of routing in a performance of the networks. The quality of service and security is one of the most important challenges in routing due to lack of reliable methods. Routers use routing algorithms to find the best route to a particular destination. When talking about the best path, we consider p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013